PELABELAN GRACEFUL, SKOLEM GRACEFUL DAN PELABELAN RHO TOPI PADA GRAF ILALANG

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graceful and Skolem Graceful Labelings in Extended Duplicate Twig Graphs

In this paper, we show that the class of Extended Duplicate Graph of a Twig is Graceful and Skolem-graceful. AMS SUBJECT CLASSIFICATION: 05C78.

متن کامل

Graceful Dialects

Programming languages are enormously diverse, both in their essential concepts and in their accidental aspects. This creates a problem when teaching programming. To let students experience the diversity of essential concepts, the students must also be exposed to an overwhelming variety of accidental and irrelevant detail: the accidental differences between the languages are likely to obscure th...

متن کامل

Graceful and odd graceful labeling of some graphs

In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.

متن کامل

Improper Graceful and Odd-graceful Labellings of Graph Theory

Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.

متن کامل

Constructing Graceful Graphs with Caterpillars

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IJEMS:Indonesian Journal of Education and Mathematical Science

سال: 2020

ISSN: 2715-985X

DOI: 10.30596/ijems.v1i1.4354